#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=1e3+7;
vector<int> G[MAXN];
bool visited[MAXN][MAXN];
int now;
int n,m;
void DFS(int a) {
	int len=G[a].size();
	int nex;
	visited[now][a]=true;
	for (int i=0; i<len; ++i) {
		nex=G[a][i];
		if (!visited[now][nex]) {
			DFS(nex);
		}
	}
}
void MyDFS() {
	memset(visited, 0, sizeof(visited));
	now=1;
	for (int i=1; i<=n; ++i) {
		visited[i][i]=true;
		DFS(i);
		++now;
	}
	for (int i=1; i<=n; ++i) {
		for (int j=1; j<=n; ++j) {
			if (visited[i][j]) visited[j][i]=true;
		}
	}
}
int main() {
//	freopen("abc.txt", "r", stdin);
	int T;
	int a,b;
	cin>>T;
	while (T--) {
		scanf("%d%d", &n, &m);
		for (int i=1; i<=n; ++i) {
			G[i].clear();
		}
		for (int i=0; i<m; ++i) {
			scanf("%d%d", &a, &b);
			G[a].push_back(b);
		}
		MyDFS();
		bool ok=true;
		for (int i=1; i<=n; ++i) {
			for (int j=1; j<=n; ++j) {
				if (!visited[i][j]) {
					ok=false;
					break;
				}
			}
			if (!ok) break;
		}
		if (!ok) printf("Light my fire!\n");
		else printf("I love you my love and our love save us!\n");
	}
	return 0;
}
